Optimization problem - PDFSEARCH.IO - Document Search Engine

Optimization problem
Results: 1483

#	Item
81	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut
82	The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate Add to Reading List Source URL: users.cms.caltech.edu Language: English - Date: 2008-11-17 17:17:16 Mathematics Combinatorics Combinatorial optimization Matroid theory Discrete mathematics Matroid Greedoid Partition matroid Matroid oracle
83	Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen Department of Mathematical Sciences Johns Hopkins University Baltimore, MD 21218 Add to Reading List Source URL: www.cs.tufts.edu Language: English - Date: 2012-10-31 09:54:20 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Set cover problem Approximation algorithm Facility location problem Dominating set Combinatorial optimization Reduction Algorithm
84	Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade Add to Reading List Source URL: www.opt.uni-duesseldorf.de Language: English - Date: 2003-10-16 08:07:54 Mathematical optimization Numerical analysis Mathematical analysis Linear programming Convex optimization Interior point method Quadratic programming Global optimization Robert J. Vanderbei Quasi-Newton method Nonlinear programming Linear matrix inequality
85	Apt-pbo: Solving the Software Dependency Problem using Pseudo-Boolean Optimization Paulo Trezentos Inês Lynce Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Software Computer architecture System software Dpkg Archive formats Ubuntu Debian Package manager Software distribution Advanced Packaging Tool Deb RPM Package Manager
86	239 Documenta Math. Ronald Graham: Laying the Foundations of Online Optimization Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2012-07-25 10:25:05 Scheduling Operations research Mathematics Applied mathematics Computer science Makespan Online algorithm Job Competitive analysis Algorithm Optimization problem Job shop scheduling
87	107 Documenta Math. A Brief History of Linear and Mixed-Integer Programming Computation Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2012-07-25 10:24:47 Operations research Mathematical optimization Mathematics Numerical analysis Linear programming CPLEX Algorithm Simplex algorithm Simplex Integer programming MPS Travelling salesman problem
88	CS261: Exercise Set #8 For the week of February 22–26, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-02-26 12:53:21 Mathematics Computational complexity theory Graph theory NP-complete problems Operations research Travelling salesman problem Theoretical computer science Approximation algorithm Steiner tree problem Greedy algorithm Optimization problem Set cover problem
89	MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems Hanna SUMITA, Naonori KAKIMURA, and Add to Reading List Source URL: www.keisu.t.u-tokyo.ac.jp Language: English - Date: 2013-01-25 04:57:12 Computational complexity theory Mathematics Operations research Algebra Linear algebra Linear complementarity problem Mathematical optimization Linear programming NP Inequality Time complexity LCP array
90	Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra Combinatorial optimization Search algorithms Game artificial intelligence A* search algorithm Shortest path problem Flow network Tree Graph